A Direct Combinatorial Proof of a Positivity Result

نویسندگان

  • J. Gillis
  • Doron Zeilberger
چکیده

"A simple result deserves a simple proof" I Objects lying in four different boxes are rearranged in such a way that the number of objects where the bottom is a rearrangement of the top. The weight W (T) of the multiset permutation T is defined to be (-I) ~-where U, is the number of columns of the form I: 111122333444 , x # y. For example, if n-= 441223133411 then U, = 7 and w (n-) = (-~) ~ =-1. If % is a set, we write w (%) =I,,, w (u) , and if % and Y are sets, we denote as usual ~ ~ Y = { (u , v) ; U E % , U E Y). (a + b-u) ! (c + d-u) ! ~ ! ~ I W(&(a, b, c, d)) = 1 i a ! b ! c ! d !)-1) ()12 r U-r Us in each box stays the same. Askey, Ismail, and Koornwinder proved that the cardinality of the set of rearrangements for which the number of objects changing boxes is even-exceeds the cardinality of the set of rearrangements for which that number is odd. We give a simple counting proof of this fact. Members of four different clubs, each wearing a hat with an insignia of his club, hang their hats on entering the hall. When they leave there is a power failure and the departing pests scramble for hats in the dark. Assuming the hats were picked at an entirely random fashion, would you bet that the number of guests wearing hats with wrong insignias is even? Askey, Ismail, and Koornwinder [ I , p. 2851 proved that the answer is always yes, no matter how many members belong to each club. Their proof was "analytical" in that it employed an inequality of Koornwinder [ 7 ] concerning integrals of products of Laguerre polynomials. Ismail and Tamhankar [5], and independently Gillis and Kleeman [4], gave elementary proofs of this result. However, both of these employed the rather deep "Master Theorem" of McMahon and the relatively sophisticated notion of "generating function". We are going to give a direct counting argument which should be understood by the proverbial bright grade school student. Although our proof is formally from scratch, it does employ the elegant methods of Foata [2], [3]. As a matter of fact it was conceived while we were reading through …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

عدد تناوبی گراف‌ها

In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem. 

متن کامل

Towards a Combinatorial Proof of Gessel’s Conjecture on Two-sided Gamma Positivity: a Reduction to Simple Permutations

Gessel conjectured that the two-sided Eulerian polynomial, recording the common distribution of the descent number of a permutation and that of its inverse, has nonnegative integer coefficients when expanded in terms of the gamma basis. This conjecture has been proved recently by Lin. Unlike the corresponding result for the usual Eulerian polynomial, the proof for the two-sided version was not ...

متن کامل

Anna Pun Drexel University “ On Decomposition of the Product of Demazure Atom and Demazure Characters ”

It is an open problem to prove the Schubert positivity property combinatorially. Recently Haglund, Mason, Remmel, van Willigenburg et al. have studied the skyline fillings (a tableau-combinatorial object giving a combinatorial description to nonsymmetric MacDonald polynomials , proved by Haglund, Haiman and Loehr) specifically for the case of Demazure atoms (atoms) and key polynomials (keys). T...

متن کامل

Dual Equivalence Graphs and a Combinatorial Proof of Llt and Macdonald Positivity

We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. By constructing a graph on ribbon tableaux which we transform into a dual equivalence graph, we give a combinatorial proof of the symmetry and Schur positivity of the ribbon tableaux generating func...

متن کامل

The Schur Expansion of Macdonald Polynomials

Building on Haglund’s combinatorial formula for the transformed Macdonald polynomials, we provide a purely combinatorial proof of Macdonald positivity using dual equivalence graphs and give a combinatorial formula for the coefficients in the Schur expansion.

متن کامل

A SHORT PROOF OF A RESULT OF NAGEL

Let $(R,fm)$ be a Gorenstein local ring and$M,N$ be two finitely generated modules over $R$. Nagel proved that if $M$ and $N$ are inthe same even liaison class, thenone has $H^i_{fm}(M)cong H^i_{fm}(N)$ for all $iIn this paper, we provide a short proof to this result.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1983